SFSDP: a Sparse Version of Full SemiDefinite Programming Relaxation for Sensor Network Localization Problems
نویسندگان
چکیده
SFSDP is a Matlab package for solving a sensor network localization problem. These types of problems arise in monitoring and controlling applications using wireless sensor networks. SFSDP implements the semidefinite programming (SDP) relaxation proposed in Kim et al. [2009] for sensor network localization problems, as a sparse version of the full semidefinite programming relaxation (FSDP) by Biswas and Ye [2004]. To improve the efficiency of FSDP, SFSDP exploits the aggregated and correlative sparsity of a sensor network localization problem. As a result, SFSDP can handle much larger-sized problems than other softwares, and three-dimensional anchor-free problems. SFSDP can analyze the input data of a sensor network localization problem, solves the problem, and displays the computed locations of sensors. SFSDP also includes the features of generating test problems for numerical experiments.
منابع مشابه
ISSN 1342-2804 User Manual for SFSDP: a Sparse versions of Full SemiDefinite Programming Relaxation for Sensor Network Localization Problems
SFSDP is a Matlab package for solving sensor network localization problems. The package contains four functions, SFSDP.m, SFSDPplus.m, generateProblem.m, test SFSDP.m, and some numerical examples. The function SFSDP.m is an Matlab implementation of the semidefinite programming (SDP) relaxation proposed in the recent paper by Kim, Kojima and Waki for sensor network localization problems, as a sp...
متن کاملParallel Implementation of Successive Sparse SDP Relaxations for Large-Scale Euclidean Distance Geometry Problems
The Euclidean distance geometry problem (EDGP) includes locating sensors in a sensor network and constructing a molecular configuration using given distances in the two or three-dimensional Euclidean space. When the locations of some nodes, called anchors, are given, the problem can be dealt with many existing methods. An anchorfree problem in the three-dimensional space, however, is a more cha...
متن کامل1342 - 2804 A Continuation Method for Large - sized Sensor Network Localization Problems
The solution methods based on semidefinite programming (SDP) relaxations for sensor network localization (SNL) problems can not handle very large-sized SNL problems. We present a continuation method using the gradient descent method to efficiently solve large-sized SNL problems. We first formulate the problem as an unconstrained optimization problem and then apply the continuation on the distan...
متن کاملExploiting Sparsity in SDP Relaxation for Sensor Network Localization
A sensor network localization problem can be formulated as a quadratic optimization problem (QOP). For quadratic optimization problems, semidefinite programming (SDP) relaxation by Lasserre with relaxation order 1 for general polynomial optimization problems (POPs) is known to be equivalent to the sparse SDP relaxation by Waki et al. with relaxation order 1, except the size and sparsity of the ...
متن کاملComparing SOS and SDP relaxations of sensor network localization
We investigate the relationships between various sum of squares (SOS) and semidefinite programming (SDP) relaxations for the sensor network localization problem. In particular, we show that Biswas and Ye’s SDP relaxation is equivalent to the degree one SOS relaxation of Kim et al. We also show that Nie’s sparse-SOS relaxation is stronger than the edge-based semidefinite programming (ESDP) relax...
متن کامل